Approximation Algorithm for Optimal Wiring on Rectangular Structure
نویسندگان
چکیده
منابع مشابه
Optimal Wiring on Rectangular Structure
In this paper we worked upon on optimal wiring on rectangular structure. Here we are given a rectangle partitioned into smaller rectangles by axis-parallel line segments. Find a subset of the segments such that the resulting structure from these segments is connected and it touches every smaller rectangle. Here we reduce the problem of exact cover by 3-sets (X3C), which is known to be NP-comple...
متن کاملA Linear-Time Approximation Algorithm for Minimum Rectangular Covering
We consider the problem of covering polygons, without any acute interior angles, with rectangles. The rectangles must lie entirely within the polygon and it is preferable to cover the polygon with as few rectangles as possible. This problem has an application in fabricating masks for integrated circuits. Let P be an arbitrary hole-free input polygon, with n vertices, cover-able by rectangles. L...
متن کاملAn Optimal Approximation Algorithm for Bayesian Inference
Approximating the inference probability Pr X xjE e in any sense even for a single evidence node E is NP hard This result holds for belief networks that are allowed to contain extreme conditional probabilities that is conditional probabilities arbitrarily close to Nevertheless all previous approximation algorithms have failed to approximate e ciently many inferences even for belief networks with...
متن کاملA heuristic algorithm for optimal placement of rectangular objects
The problem of partitioning a two-dimensional area into pieces having certain sizes with a minimum of wasted space is very important, especially in packing components tightly in the manufacture of very large-scale integrated circuits. The purpose of this paper is to examine the problem of placing rectangular objects in a rectangular area so as to minimize the wasted space. from the viewpoint of...
متن کاملOptimal Parallel algorithm for String Matching on Mesh Network Structure
In this paper we consider the problem of string matching algorithm based on a two-dimensional mesh. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using mesh connected network which achieves a constant time for mismatch a text string and we obtained O(¥. -ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/13176-0675